Dispatching in perfectly-periodic schedules
نویسندگان
چکیده
منابع مشابه
Dispatching in perfectly-periodic schedules
In a perfectly-periodic schedule, time is divided into time-slots, and each client gets a time slot precisely every predefined number of time slots, called the period of that client. Periodic schedules are useful in mobile communication where they can help save power in the mobile device, and they also enjoy the best possible smoothness. In this paper we study the question of dispatching in a p...
متن کاملAdaptive general perfectly periodic scheduling
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known as the period of the client. The periodicity of such schedules can be used to save battery life of nodes in a wireless network. The quality of a perfectly periodic schedule is a function of the ratio between the gran...
متن کاملPeriodic schedules for linear precedence constraints
We consider the computation of periodic cyclic schedules for linear precedence constraints graph: a linear precedence constraint is defined between two tasks and induces an infinite set of usual precedence constraints between their executions such the the difference of iterations is a linear function.The objective function is the minimization of the maximal period of a task. Firstly, we recall ...
متن کاملOptimization models for improving periodic maintenance schedules by utilizing opportunities
We present mathematical models for finding optimal opportunistic maintenance schedules for systems, in which components are assigned maximum replacement intervals. Our models are applied to safety-critical components in an aircraft engine, for which maintenance opportunities naturally arise since entire modules are sent to the workshop when maintenance is required on one or more components. Cas...
متن کاملMinimizing Average Startup Delay of Periodic VOD Broadcasting Schedules
Consider a video consisting of a sequence of fixedsize pages to be transmitted over c broadcast channels such that a page fits in a slot of a channel. In Shifted Harmonic Windows scheduling, page i must be scheduled at least once in any consecutive i+m−1 slots for some integer m ≥ 1, to ensure continuous display of successive pages by the viewer, starting at the m slot boundary after tuning in....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2003
ISSN: 0196-6774
DOI: 10.1016/s0196-6774(03)00089-0